Solving the Two-Stage Cutting Stock Problem

ثبت نشده
چکیده

I N T R O D U C T I O N In a number of industries, such as paper and film, there is an important class of problems OVER THE past 20 years, a substantial amount that falls in between the well known one and of work has been done on one and two-dimentwo-dimensional problems. These are referred sional cutting stock problems. A number of to here as two-stage cutting stock problems early authors [1, 6-8] recognized that the roll because the material is processed through two trim problem in the paper industry could be distinct cutting operations. It differs from the formulated as a linear programming model, multi-stage cutting problems discussed by GilThe pioneering computational work by Gilmore and Gomory because the first and second more and Gomory [2,33 on delayed pattern stage cuts are parallel to one another. This generation techniques made it practical to find .pr°blem has not been discussed in the literalinear programming solutions to large oneture even though it occurs in a number of indimensional problems. Follow-up research by dustries. This two-stage cutting may be necessPierce [9] focused on the use of this algorithm ary because of the nature of the production in the paper industry to solve the roll trim process and the type of equipment available problem. Gilmore and Gomory [4] subseor to give flexibility so that orders that vary quently extended their work to higher dimenin some characteristic other than width can be sional problems such as the cutting of reccombined across the width of the primary protangles from rectangles, a common problem in duction process. Regardless of the reason, prothe glass industry. They overcame the difficulty duction rolls are first slit into master roll of generating patterns in higher dimensions by widths at the first stage and the master roll limiting themselves to patterns with guillotine widths are then slit to the ordered sizes at the cuts (once a cut is begun it must be continued second stage. Limitations in the master roll through to the other side of the material in sizes that can be processed at the second stage a straight line). As a result the problem of make it necessary to impose additional restricgenerating a higher dimensional cutting pattions on the pattern generating process relative tern can be handled by sequentially solving a to the well known one-dimensional roll trim number of one-dimensional problems. Their problem. multi-stage approach in the two-dimensional case focuses first on cutting patterns for strips G E N E R A L PROBLEM of known width and length and then on ways CONSIDERATIONS these strips can be combined to form twodimensional patterns. Consider the production process sketched in

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

A simple approach to the two-dimensional guillotine cutting stock problem

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...

متن کامل

Solving the Assortment and Trim Loss Problem with Branch-and-Price-and-Cut

In this paper, we address the combined assortment and trim loss minimization problem. In real settings, when different stock lengths are available, a common problem is to select a subset of stock lengths from which to cut the ordered items. In the cutting and packing literature, this problem is known as the assortment problem. Solving the assortment and trim loss minimization problem in a singl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003